منابع مشابه
An upper bound for permanents of nonnegative matrices
A recent conjecture of Caputo, Carlen, Lieb, and Loss, and, independently, of the author, states that the maximum of the permanent of a matrix whose rows are unit vectors in lp is attained either for the identity matrix I or for a constant multiple of the all-1 matrix J . The conjecture is known to be true for p = 1 (I) and for p ≥ 2 (J). We prove the conjecture for a subinterval of (1, 2), and...
متن کاملAn upper bound for the minimum rank of a graph
For a graph G of order n, the minimum rank of G is defined to be the smallest possible rank over all real symmetric n × n matrices A whose (i, j)th entry (for i 6= j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. We prove an upper bound for minimum rank in terms of minimum degree of a vertex is valid for many graphs, including all bipartite graphs, and conjecture this bound ...
متن کاملApproximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound
We consider two known lower bounds on randomized communication complexity: The smooth rectangle bound and the logarithm of the approximate nonnegative rank. Our main result is that they are the same up to a multiplicative constant and a small additive term. The logarithm of the nonnegative rank is known to be a nearly tight lower bound on the deterministic communication complexity. Our result i...
متن کاملAn upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices
We derive an upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices using Markovian type counting arguments. The bound is expressed as the maximum of a nonlinear concave function over a finite-dimensional convex polytope of probability distributions. ∗Research supported by ONR MURI N00014-1-0637, DARPA grant No. N66001-00-C8062, and by NSF contract ECS 0123...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2014
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2013.10.004